Efficiently parallel implementation of the inverse Sherman-Morrison algorithm
نویسندگان
چکیده
We contribute two parallel strategies to compute the exact and approximate inverse of a dense matrix, based on the so-called inverse Sherman-Morrison algorithm and demonstrate their efficiencies on multicore CPU and GPU-equipped computers. Our methods are shown to be much better than a common matrix inverse method, yielding up to 12 times faster performance. A comparison of the performance of the CPU and GPU versions is made and analyzed with the aid of a performance model.
منابع مشابه
Some Modifications to Calculate Regression Coefficients in Multiple Linear Regression
In a multiple linear regression model, there are instances where one has to update the regression parameters. In such models as new data become available, by adding one row to the design matrix, the least-squares estimates for the parameters must be updated to reflect the impact of the new data. We will modify two existing methods of calculating regression coefficients in multiple linear regres...
متن کاملA Parallel Algorithm for Matrix Inversion based on the Sherman-Morrison Formula
A matrix inversion algorithm based on the Sherman-Morrison formula is analyzed and compared with the classical Gauss-Jordan algorithm. In particular the results obtained in a Cray T3-E by the parallel versions of both algorithms are compared. Key-Words:Sherman-Morrison formula, matrix inversion, Parallel algorithms, Cray T3-E
متن کاملSolving Updated Systems of Linear Equations in Parallel ?
In this paper, updating algorithms for solving linear systems of equations are presented using a systolic array model. First, a parallel algorithm for computing the inverse of rank-one modiied matrix using the Sherman-Morrison formula is proposed. This algorithm is then extended to solving the updated systems of linear equations on a linear systolic array. Finally, the generalisation to the upd...
متن کاملA robust approximate inverse preconditioner based on the Sherman-Morrison formula∗
To solve a large, and sparse linear system Ax = b; (1) an approximate solution of (1) is usually obtained by using a preconditioned iterative Krylov subspace method [6]. In this work we focus on factorized approximate inverse preconditioners, in this class of preconditioners two matrices such that its product is an approximation of the inverse of A are computed and stored explicitely. Therefore...
متن کاملA generalization of the Sherman-Morrison-Woodbury formula
In this paper, we develop conditions under which the Sherman–Morrison–Woodbury formula can be represented in the Moore–Penrose inverse and the generalized Drazin inverse forms. These results generalize the original Sherman–Morrison–Woodbury formula. © 2011 Elsevier Ltd. All rights reserved.
متن کامل